Degree sequences of matrogenic graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

λ-Coloring Matrogenic Graphs

This paper investigates a variant of the general problem of assigning channels to the stations of a wireless network when the graph representing the possible interferences is a matrogenic graph. In our problem, channels assigned to adjacent vertices must be at least two apart, while channels assigned to vertices at distance two must be different. An exact linear time algorithm is provided for t...

متن کامل

Matroids arisen from matrogenic graphs

Let G be a finite simple graph and let 4(G) be the set of subsets X of V(G) such that the subgraph of G induced by X is threshold. If 4(G) is the independence system of a matroid, then G is called matrogenic [3]. In this paper, we characterize matroids arising from matrogenic graphs.

متن کامل

Degree sequences of monocore graphs

A k-monocore graph is a graph which has its minimum degree and degeneracy both equal to k. Integer sequences that can be the degree sequence of some k-monocore graph are characterized as follows. A nonincreasing sequence of integers d1, . . . , dn is the degree sequence of some k-monocore graph G, 0 ≤ k ≤ n− 1, if and only if k ≤ di ≤ min {n− 1, k + n− i} and

متن کامل

Degree Sequences of F-Free Graphs

Let F be a fixed graph of chromatic number r + 1. We prove that for all large n the degree sequence of any F -free graph of order n is, in a sense, close to being dominated by the degree sequence of some r-partite graph. We present two different proofs: one goes via the Regularity Lemma and the other uses a more direct counting argument. Although the latter proof is longer, it gives better esti...

متن کامل

Degree sequences of highly irregular graphs

We call a simple graph highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we examine the degree sequences of highly irregular graphs. We give necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a highly irregular graph.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1984

ISSN: 0012-365X

DOI: 10.1016/0012-365x(84)90023-2